Recycling Krylov subspaces for CFD applications
نویسندگان
چکیده
The most popular iterative linear solvers in Computational Fluid Dynamics (CFD) calculations are restarted GMRES and BiCGStab. At the beginning of most incompressible flow calculations, the computation time and the number of iterations to converge for the pressure Poisson equation are quite high, since the initial guess is far from the solution. In this case, the BiCGStab algorithm, with relatively cheap but non-optimal iterations, may fail to converge for stiff problems. Thus, a more robust algorithm like GMRES, which guarantees monotonic convergence, is preferred. To reduce the large storage requirements of GMRES, a restarted version GMRES(m) or its variants is used in CFD applications. However, GMRES(m) can suffer from stagnation or very slow convergence. For this reason, we use the rGCROT method. rGCROT is an algorithm that improves restarted GMRES by recycling a selected subspace of the search space from one restart of GMRES(m) to the next as well as building and recycling this outer vector space from one problem to the next (subsequent time steps in this context). Such recycling of the search space generally reduces the run time of the iterative linear solvers for CFD problems where the matrix remains constant or changes slowly for subsequent systems. In the current work, we apply both GMRES and Bi-Lanczos based recycling to CFD simulations. For a turbulent channel flow problem with rGCROT we get comparable performance to BiCGStab. The rGCROT performance is still not as cheap as the BiCGStab algorithm in terms of both storage requirements and time to solution. Thus we have used a novel hybrid approach in which we get the benefits of the robustness of the GMRES(m) algorithm and the economical iterations of BiCGStab. For the first few time steps, the algorithm builds an outer vector space using rGCROT and then it recycles that space for the rBiCGStab solver. Time to solution with this approach is comparable to that for the BiCGStab algorithm with savings in the number of iterations and improved convergence properties. For a flow through porous media simulation, we get infinite performance gains over BiCGStab, since BiCGStab does not converge to a relative tolerance of 10−10 for the L norm of the residual. Overall, the hybrid approach also performs better than optimized rGCROT and GMRES(m).
منابع مشابه
Recycling Krylov subspaces for CFD applications and a new hybrid recycling solver
We focus on robust and efficient iterative solvers for the pressure Poisson equation in incompressible Navier-Stokes problems. Preconditioned Krylov subspace methods are popular for these problems, with BiCGStab and GMRES(m) most frequently used for nonsymmetric systems. BiCGStab is popular because it has cheap iterations, but it may fail for stiff problems, especially early on as the initial g...
متن کاملModel Reduction for Time-Varying Descriptor Systems Using Krylov-Subspaces Projection Techniques
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملProjection-Based Model Reduction for Time-Varying Descriptor Systems Using Recycled Krylov Subspaces
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملRecycling Krylov Subspaces for Solving Linear Systems with Successively Changing Right-Hand Sides Arising in Model Reduction
We discuss the numerical solution of successive linear systems of equations Ax = bi, i = 1,2, . . .m, by iterative methods based on recycling Krylov subspaces. We propose various recycling algorithms which are based on the generalized conjugate residual (GCR) method. The recycling algorithms reuse the descent vectors computed while solving the previous linear systems Ax = b j, j = 1,2, . . . , ...
متن کاملPreconditioned Krylov subspace methods for solving nonsymmetric matrices from CFD applications
We conduct an experimental study on the behavior of several preconditioned iterative methods to solve nonsymmetric matrices arising from computational ̄uid dynamics (CFD) applications. The preconditioned iterative methods consist of Krylov subspace accelerators and a powerful general purpose multilevel block ILU (BILUM) preconditioner. The BILUM preconditioner and an enhanced version of it are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1501.03358 شماره
صفحات -
تاریخ انتشار 2015